Dynamical properties of the tent map

نویسندگان

  • Klaus Scheicher
  • Víctor F. Sirvent
  • P. Surer
چکیده

where β = β(β−1)−1, M ∈ N∪{∞}, and l0, l1, . . . is a uniquely determined (finite or infinite) sequence of non-negative integers (cf. [2]). Analogously to other types of expansions we may ask for bases β such that the set of numbers with periodic or even finite representation is as large as possible. In particular, we say that Tβ satisfies the periodicity property (P) if the orbit (T β (x))n≥1 is eventually periodic for all x ∈ Q(β) ∩ [0, 1], and Tβ has the finiteness property (F) whenever the Tβ-orbit of each element of Q(β) ∩ [0, 1] contains 0. The principle intention of the talk is to present result concerning (P) and (F). At the beginning we summarise several well-known facts published by Lagarias et al. in [2, 3]. The focus is on a recently discovered connection between tent maps and generalised beta-transformations that allows us to transfer results concerning periodicity and finiteness properties (see [4]). Define the set

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the entropy devil’s staircase in a family of gap-tent maps

To analyze the trade-off between channel capacity and noise-resistance in designing dynamical systems to pursue the idea of communications with chaos, we perform a measure theoretic analysis the topological entropy function of a “gap-tent map” whose invariant set is an unstable chaotic saddle of the tent map. Our model system, the “gap-tent map” is a family of tent maps with a symmetric gap, wh...

متن کامل

Allowed Patterns of Symmetric Tent Maps via Commuter Functions

We introduce a new technique to study pattern avoidance in dynamical systems, namely the use of a commuter function between non-conjugate dynamical systems. We investigate the properties of such a commuter function, specifically h : [0, 1]→ [0, 1] satisfying T1 ◦ h = h ◦ Tμ, where Tμ denotes a symmetric tent map of height μ. We make use of this commuter function to prove strict inclusion of the...

متن کامل

Analog error-correcting codes based on chaotic dynamical systems

The properties of chaotic dynamical systems make them useful for channel coding in a variety of practical communication applications. To illustrate this, a novel analog code based on tent map dynamics and having a fast decoding algorithm is developed for use on unknown, multiple, and time-varying signal-to-noise ratio (SNR) channels. This code is shown to be an attractive alternative to both di...

متن کامل

Image encryption based on chaotic tent map in time and frequency domains

The present paper is aimed at introducing a new algorithm for image encryption using chaotic tent maps and the desired key image. This algorithm consists of two parts, the first of which works in the frequency domain and the second, in the time domain. In the frequency domain, a desired key image is used, and a random number is generated, using the chaotic tent map, in order to change the phase...

متن کامل

Regularity of Commuter Functions for Homeomorphic Defect Measure in Dynamical Systems Model Comparison

In the field of dynamical system, conjugacy describes an equivalent relation between two dynamical systems. In our work, we are dealing with mostly conjugacy, which relates two dynamical systems that are not necessarily conjugate. We generate a function called ”commuter” based on a fixed point iteration scheme. The resulting ”commuter” is a nonhomeomorphic change of coordinates translating betw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. London Math. Society

دوره 93  شماره 

صفحات  -

تاریخ انتشار 2016